扩展MapObjects数据源的研究II:空间数据在SQL Server中的存取

在Shapefiles空间数据序列化的基础上,讨论了怎样在SQLServer上建立含有二进制大对象(BLOB)类型数据的数据表,介绍了利用ADO.NET技术在内存中建立对应数据表(DataTable)的方法;通过连接(SqlConnection)对象、命令(SqlCommand)对象和数据适配器(SqlDataAdapter)对象等实现了在两个数据表间存取空间数据和属性数据,进而可以高效地进行GIS应用开发。     

Assessment of QuickBird high spatial resolution imagery to detect red attack damage due to mountain pine beetle infestation

High spatial resolution remotely sensed data has the potential to complement existing forest health programs for both strategic planning over large areas, as well as for detailed and precise identification of tree crowns subject to stress and infestation. The area impacted by the current mountain pine beetle (Dendroctonus ponderosae Hopkins) outbreak in British Columbia, Canada, has increased 40-fold over the previous 5 years, with approximately 8.5 million ha of forest infested in 2005. As a result of the spatial extent and intensity of the outbreak, new technologies are being assessed to help detect, map, and monitor the damage caused by the beetle, and to inform mitigation of future beetle outbreaks. In this paper, we evaluate the capacity of high spatial resolution QuickBird multi-spectral imagery to detect mountain pine beetle red attack damage. ANOVA testing of individual spectral bands, as well as the Normalized Difference Vegetation Index (NDVI) and a ratio of red to green reflectance (Red-Green Index or RGI), indicated that the RGI was the most successful (p < 0.001) at separating non-attack crowns from red attack crowns. Based on this result, the RGI was subsequently used to develop a binary classification of red attack and non-attack pixels. The total number of QuickBird pixels classified as having red attack damage within a 50 m buffer of a known forest health survey point were compared to the number of red attack trees recorded at the time of the forest health survey. The relationship between the number of red attack pixels and observed red attack crowns was assessed using independent validation data and was found to be significant (r² = 0.48, p < 0.001, standard error = 2.8 crowns). A comparison of the number of QuickBird pixels classified as red attack, and a broader scale index of mountain pine beetle red attack damage (Enhanced Wetness Difference Index, calculated from a time series of Landsat imagery), was significant (r² = 0.61, p < 0.001, standard error = 1.3 crowns). These results suggest that high spatial resolution imagery, in particular QuickBird satellite imagery, has a valuable role to play in identifying tree crowns with red attack damage. This information could subsequently be used to augment existing detailed forest health surveys, calibrate synoptic estimates of red attack damage generated from overview surveys and/or coarse scale remotely sensed data, and facilitate the generation of value-added information products, such as estimates of timber volume impacts at the forest stand level.     

电子学全息术用于三维物场分层再现的实验实现

基于电子学会息术（又称数字全息术）记录和再现光学全息图的原理和方法，设计了一种适合于用于尺寸较小的CCD靶面直接记录光学全息图的实验光路，并由此实现了三维物场清晰的分层再现。讨论了物场频谱的有效分离及提取方法，并提出了利用双参考光原理改善全息图再现像空间频谱带宽的新思路。与传统的光学全息术相比，电子学全息术借助于高分辨率CCD记录及高速计算机数字处理技术，可以实现光学全息图的数字化记录和重现。同时在不改变光路的前提下，可以较高的重复频率完成光学全息图的记录，以便于记录三维物场的变化过程，并且可以接近实时地再现物场或对物场进行逐层分析，因而是一种准实时的新型全息成像技术。     

基于三层结构的设备计划管理系统开发

分析了设备计划管理系统的流程需求，以及三层客户／服务器结构模型。并结合组件对象模型技术，给出了设备计划管理系统的三层客户／服务器结构和数据结构，设计了各层的组件及主要功能。     

基于高阶统计的空间谱估计研究

基于阵列输出信号的四阶累积量，研究了高发辨率空间信号到达方向的空间谱估计方法。计算机模拟实验验证了它们的有效性，证明了基于高阶统计的空间谱估计技术适用于任意高斯噪声环境。     

空间数据挖掘模型和方法研究

本文提出一个基于空间数据仓库的空间数据挖掘模型，讨论了空间关联规则发现、空间分类发现、空间聚类发现和空间数据总结等四类空间数据挖掘任务的目标、采用的挖掘方法和空间采样数据的处理方法。最后，从基于空间数据仓库的数据挖掘角度出发，提出有待深入研究和探索的问题。     

图书馆数字化管理系统的分析

“复合图书馆”是今后相当长历史时期图书馆存在的基本形态 ,复合图书馆采取数字化管理是一种发展趋势 .本文提出了复合图书馆数字化管理系统模式—图书馆资源计划 .探讨了基于供应链管理思想的图书馆资源计划的含义 ,分析了图书馆的供应链结构以及图书馆资源计划的组成部分 .     

一种基于规划知识图的规划识别算法

提出了一种新的规划表示方法及规划知识图的概念.与目前规划识别领域广泛使用的Kautz方法相比,新的规划表示方法更加简便与直观.由于在规划知识图中增加了支持程度的概念,使得规划的识别可以随着收集到的新证据而合理地加以改变.所提出的基于规划知识图的规划识别算法把规划的识别问题转化为图搜索问题,因而其效率更高,但其识别结果与Kautz方法是一致的.     

ORACLE8i Spatial空间数据仓库空间数据特性简析

主要介绍了 ORACLE 8i Spatial空间数据仓库的基本组成和空间数据的概念 ,阐述了空间数据模型中的几何类型和特性 ,从而保证了几何描述和 ORACL E数据库的库表结构的一致性和描述的完整性。     

Hanoi塔问题的一种非递归算法

通过对 Hanoi塔问题的研究 ,给出了 Hanoi塔问题的非递归算法的思想和流程图 ,并用不允许递归调用的 BASIC语言实现了 Hanoi塔问题的非递归算法。该算法的优点在于可一次性求得总移动次数 ,但从程序结构看其编程思路较复杂 ,难于理解 ,算法的时间复杂性和空间复杂性与递归算法无异。